package leetcode.D200.T128;

import util.ListUtil;

public class M128 {
    public static void main(String[] args) {
        int[] nums = ListUtil.parseIntArray("[0,3,7,2,5,8,4,6,0,1]");
        System.out.println(new Solution().longestConsecutive(nums));
    }
}
